3 research outputs found
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants
The currently best known algorithms for the numerical evaluation of
hypergeometric constants such as to decimal digits have time
complexity and space complexity of or .
Following work from Cheng, Gergel, Kim and Zima, we present a new algorithm
with the same asymptotic complexity, but more efficient in practice. Our
implementation of this algorithm improves slightly over existing programs for
the computation of , and we announce a new record of 2 billion digits for